package demo.practice.binary_tree;

public class Offer56 {


    public int singleNumber(int[] nums) {

        int res = 0;

//        for (int num : nums) {
//            res= res^( num^num^num );
//        }

        return -1;

    }
}
